Algorithmic information for intermittent systems with an indifferent fixed point
نویسندگان
چکیده
Measuring the average information that is necessary to describe the behaviour of a dynamical system leads to a generalization of the Kolmogorov-Sinai entropy. This is particularly interesting when the system has null entropy and the information increases less than linearly with respect to time. We consider two classes of maps of the interval with an indifferent fixed point at the origin and an infinite natural invariant measure. We calculate that the average information that is necessary to describe the behaviour of its orbits increases with time n approximately as nα, where α < 1 depends only on the asymptotic behaviour of the map near the origin.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملFixed point theory for cyclic $varphi$-contractions in fuzzy metric spaces
In this paper, the notion of cyclic $varphi$-contraction in fuzzymetric spaces is introduced and a fixed point theorem for this typeof mapping is established. Meantime, an example is provided toillustrate this theorem. The main result shows that a self-mappingon a G-complete fuzzy metric space has a unique fixed point if itsatisfies the cyclic $varphi$-contraction. Afterwards, some results inco...
متن کاملSome local fixed point results under $C$-class functions with applications to coupled elliptic systems
The main objective of the paper is to state newly fixed point theorems for set-valued mappings in the framework of 0-complete partial metric spaces which speak about a location of a fixed point with respect to an initial value of the set-valued mapping by using some $C$-class functions. The results proved herein generalize, modify and unify some recent results of the existing literature. As an ...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملLinear Fractional p-Adic and Adelic Dynamical Systems
Using an adelic approach we simultaneously consider real and padic aspects of dynamical systems whose states are mapped by linear fractional transformations isomorphic to some subgroups of GL(2, Q), SL(2, Q) and SL(2, Z) groups. In particular, we investigate behavior of these adelic systems when fixed points are rational. It is shown that any of these rational fixed points is p-adic indifferent...
متن کامل